TSTP Solution File: SEV434^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEV434^1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:45:12 EDT 2024
% Result : Theorem 0.23s 0.41s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEV434^1 : TPTP v8.1.2. Released v5.2.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 12:00:12 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (22439)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (22442)WARNING: value z3 for option sas not known
% 0.15/0.38 % (22443)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % Exception at run slice level
% 0.15/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.38 % (22440)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (22441)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (22442)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (22444)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (22445)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (22446)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % Exception at run slice level
% 0.15/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.38 % Exception at run slice level
% 0.15/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.38 % (22446)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.40 % (22448)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.15/0.40 % (22448)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.40 % Exception at run slice level
% 0.15/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.40 % (22449)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.15/0.40 % (22450)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.15/0.40 % (22449)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.41 % (22449)First to succeed.
% 0.23/0.41 % (22449)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22439"
% 0.23/0.41 % (22449)Refutation found. Thanks to Tanya!
% 0.23/0.41 % SZS status Theorem for theBenchmark
% 0.23/0.41 % SZS output start Proof for theBenchmark
% 0.23/0.41 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.41 thf(func_def_0, type, f: $o > $i).
% 0.23/0.41 thf(func_def_7, type, sK3: $i > $o).
% 0.23/0.41 thf(func_def_8, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.23/0.41 thf(func_def_9, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.23/0.41 thf(func_def_10, type, vAND: $o > $o > $o).
% 0.23/0.41 thf(func_def_11, type, vOR: $o > $o > $o).
% 0.23/0.41 thf(func_def_12, type, vIMP: $o > $o > $o).
% 0.23/0.41 thf(func_def_13, type, vNOT: $o > $o).
% 0.23/0.41 thf(func_def_14, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.23/0.41 thf(f315,plain,(
% 0.23/0.41 $false),
% 0.23/0.41 inference(subsumption_resolution,[],[f297,f276])).
% 0.23/0.41 thf(f276,plain,(
% 0.23/0.41 ($false != vAPP($i,$o,sK3,sK1))),
% 0.23/0.41 inference(unit_resulting_resolution,[],[f14,f12,f13,f196])).
% 0.23/0.41 thf(f196,plain,(
% 0.23/0.41 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($false != vAPP($i,$o,sK3,X0)) | (X1 = X2) | (X0 = X2) | (X0 = X1)) )),
% 0.23/0.41 inference(constrained_superposition,[],[f59,f15])).
% 0.23/0.41 thf(f15,plain,(
% 0.23/0.41 ( ! [X0 : $i] : ((vAPP($o,$i,f,vAPP($i,$o,sK3,X0)) = X0)) )),
% 0.23/0.41 inference(cnf_transformation,[],[f11])).
% 0.23/0.41 thf(f11,plain,(
% 0.23/0.41 ! [X0] : (vAPP($o,$i,f,vAPP($i,$o,sK3,X0)) = X0)),
% 0.23/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f1,f10])).
% 0.23/0.41 thf(f10,plain,(
% 0.23/0.41 ! [X0] : (? [X1 : $o] : (vAPP($o,$i,f,X1) = X0) => (vAPP($o,$i,f,vAPP($i,$o,sK3,X0)) = X0))),
% 0.23/0.41 introduced(choice_axiom,[])).
% 0.23/0.41 thf(f1,axiom,(
% 0.23/0.41 ! [X0] : ? [X1 : $o] : (vAPP($o,$i,f,X1) = X0)),
% 0.23/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj)).
% 0.23/0.41 thf(f59,plain,(
% 0.23/0.41 ( ! [X0 : $i,X1 : $i] : ((X0 = X1) | (vAPP($o,$i,f,$false) = X1) | (vAPP($o,$i,f,$false) = X0)) )),
% 0.23/0.41 inference(superposition,[],[f55,f55])).
% 0.23/0.41 thf(f55,plain,(
% 0.23/0.41 ( ! [X0 : $i] : ((vAPP($o,$i,f,$true) = X0) | (vAPP($o,$i,f,$false) = X0)) )),
% 0.23/0.41 inference(superposition,[],[f15,f46])).
% 0.23/0.41 thf(f46,plain,(
% 0.23/0.41 ( ! [X0 : $i] : ((vAPP($o,$i,f,$true) = X0) | ($false = vAPP($i,$o,sK3,X0))) )),
% 0.23/0.41 inference(superposition,[],[f15,f5])).
% 0.23/0.41 thf(f5,plain,(
% 0.23/0.41 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.23/0.41 introduced(fool_axiom,[])).
% 0.23/0.41 thf(f13,plain,(
% 0.23/0.41 (sK0 != sK2)),
% 0.23/0.41 inference(cnf_transformation,[],[f9])).
% 0.23/0.41 thf(f9,plain,(
% 0.23/0.41 (sK1 != sK2) & (sK0 != sK2) & (sK0 != sK1)),
% 0.23/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8])).
% 0.23/0.41 thf(f8,plain,(
% 0.23/0.41 ? [X0,X1,X2] : ((X1 != X2) & (X0 != X2) & (X0 != X1)) => ((sK1 != sK2) & (sK0 != sK2) & (sK0 != sK1))),
% 0.23/0.41 introduced(choice_axiom,[])).
% 0.23/0.41 thf(f7,plain,(
% 0.23/0.41 ? [X0,X1,X2] : ((X1 != X2) & (X0 != X2) & (X0 != X1))),
% 0.23/0.41 inference(ennf_transformation,[],[f6])).
% 0.23/0.41 thf(f6,plain,(
% 0.23/0.41 ~! [X0,X1,X2] : ((X1 = X2) | (X0 = X2) | (X0 = X1))),
% 0.23/0.41 inference(rectify,[],[f3])).
% 0.23/0.41 thf(f3,negated_conjecture,(
% 0.23/0.41 ~! [X1,X0,X2] : ((X0 = X2) | (X1 = X2) | (X0 = X1))),
% 0.23/0.41 inference(negated_conjecture,[],[f2])).
% 0.23/0.41 thf(f2,conjecture,(
% 0.23/0.41 ! [X1,X0,X2] : ((X0 = X2) | (X1 = X2) | (X0 = X1))),
% 0.23/0.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3)).
% 0.23/0.41 thf(f12,plain,(
% 0.23/0.41 (sK0 != sK1)),
% 0.23/0.41 inference(cnf_transformation,[],[f9])).
% 0.23/0.41 thf(f14,plain,(
% 0.23/0.41 (sK1 != sK2)),
% 0.23/0.41 inference(cnf_transformation,[],[f9])).
% 0.23/0.41 thf(f297,plain,(
% 0.23/0.41 ($false = vAPP($i,$o,sK3,sK1))),
% 0.23/0.41 inference(unit_resulting_resolution,[],[f14,f275,f49])).
% 0.23/0.41 thf(f49,plain,(
% 0.23/0.41 ( ! [X0 : $i,X1 : $i] : ((X0 = X1) | ($false = vAPP($i,$o,sK3,X0)) | ($false = vAPP($i,$o,sK3,X1))) )),
% 0.23/0.41 inference(binary_proxy_clausification,[],[f47])).
% 0.23/0.41 thf(f47,plain,(
% 0.23/0.41 ( ! [X0 : $i,X1 : $i] : ((X0 = X1) | (vAPP($i,$o,sK3,X0) != vAPP($i,$o,sK3,X1))) )),
% 0.23/0.41 inference(constrained_superposition,[],[f15,f15])).
% 0.23/0.41 thf(f275,plain,(
% 0.23/0.41 ($false != vAPP($i,$o,sK3,sK2))),
% 0.23/0.41 inference(unit_resulting_resolution,[],[f14,f13,f12,f196])).
% 0.23/0.41 % SZS output end Proof for theBenchmark
% 0.23/0.41 % (22449)------------------------------
% 0.23/0.41 % (22449)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.23/0.41 % (22449)Termination reason: Refutation
% 0.23/0.41
% 0.23/0.41 % (22449)Memory used [KB]: 845
% 0.23/0.41 % (22449)Time elapsed: 0.013 s
% 0.23/0.41 % (22449)Instructions burned: 22 (million)
% 0.23/0.41 % (22439)Success in time 0.043 s
%------------------------------------------------------------------------------